Ultrametric Algorithms and Automata
نویسنده
چکیده
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
منابع مشابه
Advantages of Ultrametric Counter Automata
Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. No wonder that only very few examples of advantages for ultrametric algorithms over probabilistic ones have been published up to now, and all they are slightly artificial. This paper considers ultrametric and probabilistic one-counter automata w...
متن کاملUnconventional Finite Automata and Algorithms
We investigate several unconventional models of finite automata and algorithms. We show that two-way alternating automata can be smaller than fast bounded-error probabilistic automata. We introduce ultrametric finite automata which use p-adic numbers to describe the branching process of the computation. We examine the size complexity of all the abovementioned automata for the counting problem. ...
متن کاملUltrametric Automata with One Head Versus Multihead Nondeterministic Automata
The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automat...
متن کاملKaspars Balodis Unconventional Finite Automata and Algorithms Doctoral
In this thesis we investigate several unconventional models of finite automata and algorithms. We start with more conventional types of automata and prove differentiation results for the descriptional complexity classes of twoway probabilistic and alternating finite automata. Then we introduce ultrametric finite automata which use p-adic numbers as amplitudes describing the branching process of...
متن کاملState Complexity Advantages of Ultrametric Automata
Ultrametric automata have properties similar to the properties of probabilistic automata but the descriptional power of these types of automata can differ very much. In this paper, we compare ultrametric automata with deterministic, nondeterministic, probabilistic and alternating automata with various state complexities. We also show that two-way ultrametric automata can have a smaller state co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015